Improved dynamic programs for some batching problems involving the maximum lateness criterion

Improved dynamic programs for batching problems with maximum lateness criterion

We study a class of scheduling problems involving the maximum lateness criterion and an element of batching For all the problems that we examine algorithms appear in the literature which consist of a sorting step to determine an optimal job sequence followed by a dynamic programming step which determines the optimal batches In each case the dynamic program is based on a backward recursion of wh...

Profit intensity criterion for transportation problems

In this study criterion of maximum profit intensity for transportation problems, in contrast to the known criteria of minimum expenses or minimum time for transportation, is considered. This criterion synthesizes financial and time factors and has real economic sense. According to the purpose of this paper, the algorithm of the solution of such a transportation problem is constructed. It is sho...

An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum‡ow based lower bound for the P=rj=Lmax which dominates the well-known preemptive lower bound. We show that, in some cases the proposed bound strictly dominates the preemptive one while having the same complexity.

The Optimal Online Algorithms for Minimizing Maximum Lateness

It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arrive over time on a single machine to minimize maximum lateness. It was not previously known what other online algorithms are optimal for this problem. A complete characterization of all optimal online algorithms for th...

Advancements on problems involving maximum flows